Adaptive algorithm for sparse system identification using projections onto weighted l1 balls
نویسندگان
چکیده
This paper presents a novel projection-based adaptive algorithm for sparse system identification. Sequentially observed data are used to generate an equivalent number of closed convex sets, namely hyperslabs, which quantify an associated cost criterion. Sparsity is exploited by the introduction of appropriately designed weighted 1 balls. The algorithm uses only projections onto hyperslabs and weighted 1 balls, and results into a computational complexity of order O(L) multiplications/additions and O(L log2 L) sorting operations, whereL is the length of the system to be estimated. Numerical results are also given to validate the proposed method against very recently developed sparse LMS and RLS type of algorithms, which are considered to belong to the same type of algorithmic family.
منابع مشابه
Online Sparse System Identification and Signal Reconstruction Using Projections Onto Weighted ell1 Balls
This paper presents a novel projection-based adaptive algorithm for sparse signal and system identification. The sequentially observed data are used to generate an equivalent sequence of closed convex sets, namely hyperslabs. Each hyperslab is the geometric equivalent of a cost criterion, that quantifies “data mismatch”. Sparsity is imposed by the introduction of appropriately designed weighted...
متن کاملOnline Sparse System Identification and Signal Reconstruction using Projections onto Weighted ℓ1 Balls
This paper presents a novel projection-based adaptive algorithm for sparse signal and system identification. The sequentially observed data are used to generate an equivalent sequence of closed convex sets, namely hyperslabs. Each hyperslab is the geometric equivalent of a cost criterion, that quantifies “data mismatch”. Sparsity is imposed by the introduction of appropriately designed weighted...
متن کاملA Sparsity-Aware Adaptive Algorithm for Distributed Learning
In this paper, a sparsity-aware adaptive algorithm for distributed learning in diffusion networks is developed. The algorithm follows the set-theoretic estimation rationale. At each time instance and at each node of the network, a closed convex set, known as property set, is constructed based on the received measurements; this defines the region in which the solution is searched for. In this pa...
متن کاملSubband Adaptive Filter Exploiting Sparsity of System
This paper presents a normalized subband adaptive filtering (NSAF) algorithm to cope with the sparsity condition of an underlying system in the context of compressive sensing. By regularizing a weighted l1-norm of the filter taps estimate onto the cost function of the NSAF and utilizing a subgradient analysis, the update recursion of the l1-norm constraint NSAF is derived. Considering two disti...
متن کاملSparsity-Aware Affine Projection Algorithm for System Identification
This work presents a new type of the affine projection (AP) algorithms which incorporate the sparsity condition of a system. To exploit the sparsity of the system, a weighted l1-norm regularization is imposed on the cost function of the AP algorithm. Minimizing the cost function with a subgradient calculus and choosing two distinct weighting for l1-norm, two stochastic gradient based sparsity r...
متن کامل